Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
نویسندگان
چکیده
Chvátal-Gomory and Gomory fractional cuts are well-known cutting planes for pure integer programming problems. Various methods for strengthening them are known, for example based on subadditive functions or disjunctive techniques. We present a new and surprisingly simple strengthening procedure, discuss its properties, and present some computational results.
منابع مشابه
Lower Bounds for Chvátal-gomory Style Operators
Valid inequalities or cutting planes for (mixed-) integer programming problems are an essential theoretical tool for studying combinatorial properties of polyhedra. They are also of utmost importance for solving optimization problems in practice; in fact any modern solver relies on several families of cutting planes. The Chvátal-Gomory procedure, one such approach, has a peculiarity that differ...
متن کاملDeciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point
Gomory-Chvátal cuts are prominent in integer programming. The Gomory-Chvátal closure of a polyhedron is the intersection of all half spaces defined by its Gomory-Chvátal cuts. In this paper, we show that it is NP-complete to decide whether the Gomory-Chvátal closure of a rational polyhedron is empty, even when this polyhedron contains no integer point. This implies that the problem of deciding ...
متن کاملImproving Integrality Gaps via Chvátal-Gomory Rounding
In this work, we study the strength of the Chvátal-Gomory cut generating procedure for several hard optimization problems. For hypergraph matching on k-uniform hypergraphs, we show that using Chvátal-Gomory cuts of low rank can reduce the integrality gap significantly even though Sherali-Adams relaxation has a large gap even after linear number of rounds. On the other hand, we show that for oth...
متن کاملHigh Degree Sum of Squares Proofs, Bienstock-Zuckerberg hierarchy and Chvátal-Gomory cuts
Chvátal-Gomory (CG) cuts captures useful and efficient linear programs that the boundeddegree Lasserre/Sum-of-Squares (sos) hierarchy fails to capture. We present an augmentedversion of the sos hierarchy for 0/1 integer problems that implies the Bienstock-Zuckerberghierarchy by using high degree polynomials (when expressed in the standard monomial ba-sis). It follows that fo...
متن کاملStrengthening Chvátal-Gomory Cuts for the Stable Set Problem
The stable set problem is a well-knownNP-hard combinatorial optimization problem. As well as being hard to solve (or even approximate) in theory, it is often hard to solve in practice. The main difficulty is that upper bounds based on linear programming (LP) tend to be weak, whereas upper bounds based on semidefinite programming (SDP) take a long time to compute. We propose a new method to stre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 30 شماره
صفحات -
تاریخ انتشار 2002